Section: New Results

Fast Encoding of Multiplicity Codes

N. Coxon has produced a fast implementation which demonstrates that the multiplicity codes from Kopparty, Saraf and Yehkanin are indeed practical for very large databases (when used in the Private Information Retrieval setting). For instance, we can encode a ${10}^8$ bit longs message in two seconds on a regular laptop, and ${10}^9$ in thirty seconds. We envisioned a scenario where DNA sequences are encoded using these multiplicity codes: ${10}^8$ bits is the size of Drosophila melanogaster (flies), and ${10}^9$ bits is the order of magnitude of the human genome.